Finding Hidden Hamiltonian Cycles
نویسندگان
چکیده
Consider a random graph G composed of a Hamiltonian cycle on n labeled vertices and dn random edges that “hide” the cycle. Is it possible to unravel the structure, that is, to efficiently find a Hamiltonian cycle in G? We describe an O(n3 logn) steps algorithm A for this purpose, and prove that it succeeds almost surely. Part one of A properly covers the “trouble spots” of G by a collection of disjoint paths. (This is the hard part to analyze.) Part two of A extends this cover to a full cycle by the rotation-extension technique which is already classical for such problems.
منابع مشابه
On a Simple Randomized Algorithm for Finding Long Cycles in Sparse Graphs
We analyze the performance of a simple randomized algorithm for finding long cycles and 2-factors in directed Hamiltonian graphs of out-degree at most two and in undirected Hamiltonian graphs of degree at most three. For the directed case, the algorithm finds a 2-factor in O(n) expected time. The analysis of our algorithm is based on random walks on a line and interestingly resembles the analys...
متن کاملOn a simple randomized algorithm for finding a 2-factor in sparse graphs
We analyze the performance of a simple randomized algorithm for finding 2-factors in directed Hamiltonian graphs of out-degree at most two and in undirected Hamiltonian graphs of degree at most three. For the directed case, the algorithm finds a 2-factor in O(n) expected time. The analysis of our algorithm is based on random walks on the line and interestingly resembles the analysis of a random...
متن کاملMathematics of a Tetrahedron Chain and the Hamiltonian Cycle Problem
In this article we consider the problem of finding Hamiltonian cycles on a tetrahedral mesh. A Hamiltonian cycle is a closed loop through a tetrahedral mesh that visits each tetrahedron exactly once. Using techniques of a novel discrete differential geometry of n-simplices, we could immediately obtain Hamiltonian cycles on a rhombic dodecahedronshaped tetrahedral mesh consisting of 24 tetrahedr...
متن کاملUnit-length embedding of cycles and paths on grid graphs
Although there are very algorithms for embedding graphs on unbounded grids, only few results on embedding or drawing graphs on restricted grids has been published. In this work, we consider the problem of embedding paths and cycles on grid graphs. We give the necessary and sufficient conditions for the existence of cycles of given length k and paths of given length k between two given vertices ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Random Struct. Algorithms
دوره 5 شماره
صفحات -
تاریخ انتشار 1994